Computing Geodesic Distances on Triangular Meshes
نویسندگان
چکیده
We present an approximation method to compute geodesic distances on triangulated domains in the three dimensional space. Our particular approach is based on the Fast Marching Method for solving the Eikonal equation on triangular meshes. As such, the algorithm is a wavefront propagation method, a reminiscent of the Dijkstra algorithm which runs in O(n log n) steps.
منابع مشابه
Shape- and Pose-Invariant Correspondences Using Probabilistic Geodesic Surface Embedding
Correspondence between non-rigid deformable 3D objects provides a foundation for object matching and retrieval, recognition, and 3D alignment. Establishing 3D correspondence is challenging when there are non-rigid deformations or articulations between instances of a class. We present a method for automatically finding such correspondences that deals with significant variations in pose, shape an...
متن کاملComputing geodesics on triangular meshes
We present a new algorithm to compute a geodesic path over a triangulated surface. Based on Sethian’s Fast Marching Method and Polthier’s straightest geodesics theory, we are able to generate an iterative process to obtain a good discrete geodesic approximation. It can handle both convex and non-convex surfaces. r 2005 Elsevier Ltd. All rights reserved.
متن کاملWalking On Broken Mesh: Defect-Tolerant Geodesic Distances and Parameterizations
Efficient methods to compute intrinsic distances and geodesic paths have been presented for various types of surface representations, most importantly polygon meshes. These meshes are usually assumed to be well-structured and manifold. In practice, however, they often contain defects like holes, gaps, degeneracies, non-manifold configurations – or they might even be just a soup of polygons. The...
متن کاملGeodesic-based Surface Remeshing
Generation of surface meshes remains an active research problem despite the many publications addressing this topic. The main issues which must be treated by a good remeshing algorithm are: element quality, sizing control, approximation accuracy, robustness and efficiency. One reason surface meshing is such a challenging problem is the fact that using the Euclidean metric to measure distances b...
متن کاملFaster Approximations of Shortest Geodesic Paths on Polyhedra Through Adaptive Priority Queue
Computing shortest geodesic paths is a crucial problem in several application areas, including robotics, medical imaging, terrain navigation and computational geometry. This type of computation on triangular meshes helps to solve different tasks, such as mesh watermarking, shape classification and mesh parametrization. In this work, a priority queue based on a bucketing structure is applied to ...
متن کامل